space complexity
英 [speɪs kəmˈpleksəti]
美 [speɪs kəmˈpleksəti]
网络 空间复杂度; 空间复杂性; 空间复杂性学习笔记
双语例句
- The simulation results show that the new algorithm is superior to DCMPH algorithm in the performance of spanning tree and space complexity.
仿真实验表明，新算法在性能、空间复杂度方面均优于DCMPH算法。 - Solving the first k out of a short path algorithm, and other short-path k-solving algorithm, this algorithm has better time and space complexity.
出了一个求解第k短路径的算法，和其它求解第k短路径的算法相比，本算法具有较好的时间和空间复杂度。 - The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。 - But standard SVM is subject to its constraints of time and space complexity, and cannot deal with large-scale network anomaly detection problems.
但是，标准支持向量机（SVM）算法受其时间和空间复杂度约束，无法有效地处理大规模数据集。 - We prove the finite convergence of CLAR-LASSO and analyze its time and space complexity.
我们证明了CLAR-LASSO的有限收敛性，并分析了它的时间复杂度和空间复杂度。 - Experimental results show that when the time complexity and space complexity is not higher than other algorithm, this method can reduce estimation error rate.
实验结果表明，在时间复杂度、空间复杂度不高于其他算法的前提下，该方法能降低估算误差率。 - Fast composite-event probability algorithm with both linear time and space complexity is proposed.
提出了一种可应用于电力系统充裕度分析的快速组合事件概率求取方法。 - Abstract In order to decrease the space complexity of image storage and transfer, it is necessary to do image compression.
为了降低图像存储、传输的空间复杂度，必须对图像进行压缩。 - The convergence of B3 is proved, and it has less time and space complexity.
该算法是收敛的，并且大大降低了时空复杂度。 - Its description, time and space complexity and contrasting experiment data are presented.
全文给出了该算法的描述，时间/空间复杂度分析和实验比较数据。 - Additionally the algorithm has the optimal time and space complexity.
此外，这种算法具有最优的时间和空间复杂性。 - At last analyze the time complexity and the space complexity of the new algorithms.
最后根据改进，在原有的报文分类算法的时间复杂性和空间复杂性基础上分析了新算法的时间复杂性和空间复杂性。 - Corner cutting algorithm is implemented by recursion, which increases the space complexity.
简单割角法在实现的过程中使用了递归，增大了空间复杂度； - But it is large in time and space complexity, it is restricted in practical.
而动态规划由于其时间和空间复杂度的庞大，在实际使用中受到了限制。 - Compared with other algorithms, it has the least time complexity and less space complexity.
与其他二维分类算法相比，该算法具有最小的查找时间复杂度和较小的内存空间复杂度。 - The high space complexity and low efficiency of the standard PPM prediction model affect its application in Web prefetching.
标准PPM预测模型由于存在存储复杂度高、执行效率低等缺点，影响了其推广和应用。 - The time complexity and space complexity of the algorithm are all analyzed as O ( nN~ 2).
分析得出该算法的时间复杂度和空间复杂度均为O（nN2）。 - This largely decreased space complexity.
这样，大大降低了算法的空间复杂度。 - The algorithm we use has low time and space complexity, and has high parallelism.
所用算法具有较低的时间和空间复杂性，并有高度的并行性。 - MSR-II outperforms MSR not only in time/ space complexity but also in the stability of feature selection;
MSR-II不仅在时空复杂度上优于MSR，特征选择的稳定性也更高； - The time and the space complexity of the algorithm are lowest.
性能分析表明该算法具有最小的时间复杂度，并且在基于半边Z结构的情况下具有最小的额外空间复杂度。 - Performance analyses are developed aim at time and space complexity.
针对探测时间和空间复杂度等指标对算法进行了性能分析。 - Computational complexity is composed of computational time complexity and computational space complexity.
计算复杂度由计算时间复杂度和计算空间复杂度组成。 - This algorithm colligated the advantage of range location matching algorithm and the advantage of linear searching algorithm, compromised time complexity and space complexity.
该算法综合了范围定位匹配和线性匹配各自的优点，折中了算法的时间复杂度和空间复杂度。 - This thesis analyzes the time and space complexity for algorithm.
本文分析了查询算法的时间复杂度和空间复杂度。 - Finally, we analyze the space complexity and time complexity of this algorithm and compare it with previous scheme.
最后分析了改进算法的时间复杂度和空间复杂度，并与同类算法进行了比较。 - P-Stream using a tree structure and dynamic hash table for storing nodes and pointers to solve time and space complexity problem.
ρ&Stream采用树的结构和动态哈希表对结点和指针进行存储，解决了算法的时间和空间复杂度问题。 - Experiments show that the new algorithm reduces the time and space complexity, especially in the sparse dataset environment.
实验表明新的频繁闭合项集挖掘算法在一定程度上降低了时空复杂度，尤其在稀疏型数据集环境下，该算法所体现的优越性更加突出。 - Theoretical analyses show that the method has a linear space complexity and converges to the global optimum.
对算法的空间复杂度和收敛性进行了理论分析。